Solving Nonlinear Integer Arithmetic with MCSAT
نویسنده
چکیده
We present a new method for solving nonlinear integer arithmetic constraints. The method relies on the MCSat approach to solving nonlinear constraints, while using branch and bound in a conflict-directed manner. We report encouraging experimental results where the new procedure outperforms state-of-the-art SMT solvers based on bit-blasting.
منابع مشابه
Embedding the Virtual Substitution Method in the Model Constructing Satisfiability Calculus Framework
Satisfiability-modulo-theories (SMT ) solving is a technique to check the satisfiability of logical formulas. In the context of SMT solving, recently a novel technique called the model-constructing satisfiability calculus (MCSAT ) was introduced in [13, 9], with a nice embedding of the cylindrical algebraic decomposition method as a theory solving module for non-linear real arithmetic [7]. In t...
متن کاملDeciding Bit-Vector Formulas with mcSAT
The Model-Constructing Satisfiability Calculus (mcSAT) is a recently proposed generalization of propositional DPLL/CDCL for reasoning modulo theories. In contrast to most DPLL(T)-based SMT solvers, which carry out conflict-driven learning only on the propositional level, mcSAT calculi can also synthesise new theory literals during learning, resulting in a simple yet very flexible framework for ...
متن کاملOn the Satisfiability of Modular Arithmetic Formula
Modular arithmetic is the underlying integer computation model in conventional programming languages. In this paper, we discuss the satisfiability problem of modular arithmetic formulae over the finite ring Z2ω . Although an upper bound of 2 2 4) can be obtained by solving alternation-free Presburger arithmetic, it is easy to see that the problem is in fact NP-complete. Further, we give an effi...
متن کاملEncoding Basic Arithmetic Operations for SAT-Solvers
In this paper we start an investigation to check the best we can do with SAT encodings for solving two important hard arithmetic problems, integer factorization and discrete logarithm. Given the current success of using SAT encodings for solving problems with linear arithmetic constraints, studying the suitability of SAT for solving non-linear arithmetic problems was a natural step. However, ou...
متن کاملFrom Machine Arithmetic to Approximations and back again: Improved SMT Methods for Numeric Data Types
Zeljić, A. 2017. From Machine Arithmetic to Approximations and back again. Improved SMT Methods for Numeric Data Types. Digital Comprehensive Summaries of Uppsala Dissertations from the Faculty of Science and Technology 1603. 55 pp. Uppsala: Acta Universitatis Upsaliensis. ISBN 978-91-513-0162-4. Safety-critical systems, especially those found in avionics and automotive industries, rely on mach...
متن کامل